Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Yao, Q (Ed.)We describe and study a transport-based procedure called network optimal transition coupling (NetOTC) for the comparison and alignment of two networks. The networks of interest may be directed or undirected, weighted or unweighted, and may have distinct vertex sets of different sizes. Given two networks and a cost function relating their vertices, NetOTC finds a transition coupling of their associated random walks having minimum expected cost. The minimizing cost quantifies the difference between the networks, while the optimal transport plan itself provides alignments of both the vertices and the edges of the two networks. Coupling of the full random walks, rather than their marginal distributions, ensures that NetOTC captures local and global information about the networks and preserves edges. NetOTC has no free parameters and does not rely on randomization. We investigate a number of theoretical properties of NetOTC and present experiments establishing its empirical performance.more » « lessFree, publicly-accessible full text available February 1, 2026
-
Abstract We study optimal transport for stationary stochastic processes taking values in finite spaces. In order to reflect the stationarity of the underlying processes, we restrict attention to stationary couplings, also known as joinings. The resulting optimal joining problem captures differences in the long-run average behavior of the processes of interest. We introduce estimators of both optimal joinings and the optimal joining cost, and establish consistency of the estimators under mild conditions. Furthermore, under stronger mixing assumptions we establish finite-sample error rates for the estimated optimal joining cost that extend the best known results in the iid case. We also extend the consistency and rate analysis to an entropy-penalized version of the optimal joining problem. Finally, we validate our convergence results empirically as well as demonstrate the computational advantage of the entropic problem in a simulation experiment.more » « less
-
During infections with the malaria parasitesPlasmodium vivax, patients exhibit rhythmic fevers every 48 h. These fever cycles correspond with the time the parasites take to traverse the intraerythrocytic cycle (IEC). In otherPlasmodiumspecies that infect either humans or mice, the IEC is likely guided by a parasite-intrinsic clock [Rijo-Ferreiraet al.,Science368, 746–753 (2020); Smithet al.,Science368, 754–759 (2020)], suggesting that intrinsic clock mechanisms may be a fundamental feature of malaria parasites. Moreover, becausePlasmodiumcycle times are multiples of 24 h, the IECs may be coordinated with the host circadian clock(s). Such coordination could explain the synchronization of the parasite population in the host and enable alignment of IEC and circadian cycle phases. We utilized an ex vivo culture of whole blood from patients infected withP. vivaxto examine the dynamics of the host circadian transcriptome and the parasite IEC transcriptome. Transcriptome dynamics revealed that the phases of the host circadian cycle and the parasite IEC are correlated across multiple patients, showing that the cycles are phase coupled. In mouse model systems, host–parasite cycle coupling appears to provide a selective advantage for the parasite. Thus, understanding how host and parasite cycles are coupled in humans could enable antimalarial therapies that disrupt this coupling.more » « less
An official website of the United States government
